Twenty-eight Goldbach Variations
نویسنده
چکیده
We give twenty eight diverse proofs of the fundamental Euler sum identity ζ(2, 1) = ζ(3) = 8 ζ(2, 1). We also discuss various generalizations for multiple harmonic (Euler) sums and some of their many connections, thereby illustrating the wide variety of techniques fruitfully used to study such sums and the attraction of their study.
منابع مشابه
A Study of Relationship Among Goldbach Conjecture, Twin Prime and Fibonacci Number
In 2015, Liu et al. proposed a study relationship between RSA public key cryptosystem and Goldbach’s conjecture properties. They discussed the relationship between RSA and Goldbach conjecture, twin prime and Goldbach conjecture. In this paper the author will extend to introduce the relationsip among Goldbach conjecture, twin prime and Fibonacci number. Based on their contribution, the author co...
متن کاملThirty-two Goldbach Variations
We give thirty-two diverse proofs of a small mathematical gem—the fundamental Euler sum identity ζ(2,1) = ζ(3) = 8 ζ(2,1). We also discuss various generalizations for multiple harmonic (Euler) sums and some of their many connections, thereby illustrating both the wide variety of techniques fruitfully used to study such sums and the attraction of their study.
متن کاملA proof of strong Goldbach conjecture
In this paper we give a proof of the strong Goldbach conjecture by studying limit status of original continuous Godbach natural number sequence {3, 4, ..., GNL} generated by original continuous odd prime number sequence {3, 5, ..., p} when p → ∞, that is, GNL = p when p → ∞. It implies the weak Goldbach conjecture. If a prime p is defined as Goldbach prime when GNL = p then Goldbach prime is th...
متن کاملThe Goldbach Conjecture*
In the 20th century, many great mathematicians were attracted by this conjecture. In 1900, D. Hilbert gave a famous speech in an international mathematical conference, in which he proposed 23 problems to mathematicians. The Goldbach conjecture is a part of his 8th problem and the other part is the Riemann hypothesis. G. H. Hardy said that the Goldbach conjecture is one of the most difficult pro...
متن کاملGoldbach Ellipse Sequences for Cryptographic Applications
The paper studies cryptographically useful properties of the sequence of the sizes of Goldbach ellipses. We show that binary subsequences based on this sequence have useful properties. They can be used to generate keys and to provide an index-based mapping to numbers. The paper also presents a protocol for secure session keys that is based on Goldbach partitions.
متن کامل